On Group Choosability of Total Graphs
نویسندگان
چکیده
In this paper, we study the group and list group colorings of total graphs and present group coloring versions of the total and list total colorings conjectures.We establish the group coloring version of the total coloring conjecture for the following classes of graphs: graphs with small maximum degree, two-degenerate graphs, planner graphs with maximum degree at least 11, planner graphs without certain small cycles, outerplanar graphs and near outerplanar graphs with maximum degree at least 4. In addition, the group version of the list total coloring conjecture is established for forests, outerplanar graphs and graphs with maximum degree at most two.
منابع مشابه
k-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملBounds on circular consecutive choosability
The circular consecutive choosability chcc(G) of a graph G has been recently introduced in [2]. In this paper we prove upper bounds on chcc for series-parallel graphs, planar graphs and k-choosable graphs. Our bounds are tight for classes of series-parallel graphs and k-choosable graphs for k ≥ 3. Then we study the circular consecutive choosability of generalized theta graphs. Lower bounds for ...
متن کاملAdapted List Coloring of Graphs and Hypergraphs
We introduce and study adapted list coloring of graphs and hypergraphs. This is a generalization of ordinary list coloring and adapted coloring, and has more applications than these. We prove that the upper bounds on the adaptable choosability of graphs and uniform hypergraphs in terms of maximum degree are sufficiently stronger than those on the ordinary choosability, while the bounds in terms...
متن کاملChoosability, Edge Choosability, and Total Choosability of Outerplane Graphs
Let χl (G), χ ′ l (G), χ ′′ l (G), and 1(G) denote, respectively, the list chromatic number, the list chromatic index, the list total chromatic number, and the maximum degree of a non-trivial connected outerplane graph G. We prove the following results. (1) 2 ≤ χl (G) ≤ 3 and χl (G) = 2 if and only if G is bipartite with at most one cycle. (2) 1(G) ≤ χ ′ l (G) ≤ 1(G) + 1 and χ ′ l (G) = 1(G) + ...
متن کاملAcyclic improper choosability of graphs
We consider improper colorings (sometimes called generalized, defective or relaxed colorings) in which every color class has a bounded degree. We propose a natural extension of improper colorings: acyclic improper choosability. We prove that subcubic graphs are acyclically (3,1)∗-choosable (i.e. they are acyclically 3-choosable with color classes of maximum degree one). Using a linear time algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 29 شماره
صفحات -
تاریخ انتشار 2013